upper boundedの例文

• Consider a sequence of " subrealizations ", graphs whose degrees are upper bounded by the given degree sequence.
• Then the advantage of the adversary is upper bounded as a function of these resources and of the problem size.
• And offered a prize of $ 500 for determining whether or not the maximum number of unit distances can also be upper bounded by a function of this form.
• Its polynomial time bound follows from the fact that each resolution step increases the number of clauses in the instance, which is upper bounded by a quadratic function of the number of variables.
• Although this problem appears quite complex, it can be accurately solved with a branch and bound search tree algorithm or tightly upper bounded with a single multiplication of a matrix with a vector.
• The continuous time interval that the radar echo can be received is upper bounded by the time interval between the end of a transmitted pulse and the beginning of next one, say PRI-\ tau.
• Have shown that the average number of solutions to the 4 / " n " problem ( averaged over the prime numbers up to " n " ) is upper bounded polylogarithmically in " n ".
• For randomized online algorithms, the competitive ratio is lower bounded by \ Omega ( \ log n / \ log \ log n ) and upper bounded by O ( \ log ^ 2 n \ log \ log n ).
• Thus \ pi ( n ) is upper bounded by the number of natural numbers k \ le n with k \ equiv 1 or k \ equiv 5 \ pmod 6, plus one ( since this counts 1 and misses 2, 3 ).
• Zorn's lemma, one of many equivalent statements to the axiom of choice, requires that a partial order in which all chains are upper bounded have a maximal element; in the partial order on the trees of the graph, this maximal element must be a spanning tree.
• The arithmetic distance of a word is upper bounded by its hamming weight since any integer can be represented by its standard polynomial form of x = \ sum _ { i = 1 } ^ n b _ i r ^ i where the b _ i are the digits in the integer.
• To continue with the proof sketch, we conjure the union bound in probability theory which tells us that the probability of a bad event happening for a given ( y, m _ 0, \ dots, m _ L ) is upper bounded by the quantity q ^ {-n ( L + 1 ) ( 1-H _ q ( p ) ) }.
• As the complexity of GCD computations and divisions increase more than linearly with the degree, it follows that the total running time of the " repeat " loop is less than the running time of the first line of the algorithm, and that the total running time of Yun's algorithm is upper bounded by twice the time needed to compute the GCD of f and f'and the quotient of f and f'by their GCD.